Omega theorems for the iterated additive convolution of a nonnegative arithmetic function
نویسندگان
چکیده
منابع مشابه
The convolution inverse of an arithmetic function
Good, but does an inverse g of f have to exist? A necessary condition is that f(1) 6= 0. Indeed, if g is the inverse of f , then 1 = I(1) = (f ∗ g)(1) = f(1)g(1). We now show that this necessary condition is also sufficient. We assume that f(1) 6= 0 and we try and solve for g. What this means is that we are solving for infinitely many unknowns: g(1), g(2), . . . . From the above, we see that th...
متن کاملJohn-type Theorems for Generalized Arithmetic Progressions and Iterated Sumsets
A classical theorem of Fritz John allows one to describe a convex body, up to constants, as an ellipsoid. In this article we establish similar descriptions for generalized (i.e. multidimensional) arithmetic progressions in terms of proper (i.e. collision-free) generalized arithmetic progressions, in both torsion-free and torsion settings. We also obtain a similar characterization of iterated su...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A Law of the Iterated Logarithm for Arithmetic Functions
Let X,X1, X2, . . . be a sequence of centered iid random variables. Let f(n) be a strongly additive arithmetic function such that ∑ p<n f2(p) p → ∞ and put An = ∑ p<n f(p) p . If EX2 < ∞ and f satisfies a Lindeberg-type condition, we prove the following law of the iterated logarithm: lim sup N→∞ ∑N n=1 f(n)Xn AN √ 2N log logN a.s. = ‖X‖2. We also prove the validity of the corresponding weighted...
متن کاملArithmetic Convolution Rings
Arithmetic convolution rings provide a general and unified treatment of many rings that have been called arithmetic; the best known examples are rings of complex valued functions with domain in the set of non-negative integers and multiplication the Cauchy product or the Dirichlet product. The emphasis here is on factorization and related properties of such rings which necessitates prior result...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 1981
ISSN: 0022-314X
DOI: 10.1016/0022-314x(81)90003-2